Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
نویسندگان
چکیده
منابع مشابه
Low - Density Parity Check Codes for Fading Channelswith
We develop a belief-propagation-based joint decoding and channel state estimation algorithm for low-density parity check codes on fading channels with memory. The excellent empirical performance of LDPC codes on the AWGN channel and the possibility of arranging the code memory relative to the channel correlation suggests that LDPC codes have the potential to perform well on fading channels with...
متن کاملLow Density Parity Check Codes
Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...
متن کاملLow-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of I’s and each row contains a small fixed number k > j of 1’s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixed j. When used with maximum likelihood decoding on a snfhciently quiet ...
متن کاملPerformance analysis of protograph low-density parity-check codes for nakagami-m fading relay channels
In this study, the authors investigate the error performance of the protograph (low-density parity check) codes over Nakagami-m fading relay channels. The authors first calculate the decoding thresholds of the protograph codes over such channels with different fading depths (i.e. different values of m) by exploiting the modified protograph extrinsic information transfer (PEXIT) algorithm. Furth...
متن کاملLow-density parity-check codes on Markov channels
Low-density parity-check codes are studied over Markov channels with time-varying gaussian or bit-flipping noise. The belief propagation decoding algorithm is extended to include channel estimation and the gains this extension produce are experimentally determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2053890